The Asymptotic Capacity of Private Search
نویسندگان
چکیده
منابع مشابه
The Asymptotic Capacity of Private Search
The private search problem is introduced, where a dataset comprised of L i.i.d. records is replicated across N non-colluding servers, each record takes values uniformly from an alphabet of size K, and a user wishes to search for all records that match a privately chosen value, without revealing any information about the chosen value to any individual server. The capacity of private search is th...
متن کاملThe Capacity of Private Computation
We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, by expanding th...
متن کاملForgetting boosts the private capacity
A channel capacity is non-convex if the capacity of a mixture of different quantum channels exceeds the mixture of the individual capacities. This implies that there is a concrete communication scenario in which a sender can increase the transmission rate by forgetting which channel acts on the channel input. Here, we prove that the private capacity is non-convex. Introduction. Classical inform...
متن کاملThe Capacity of Private Information Retrieval with Private Side Information
The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...
متن کاملThe Asymptotic Capacity of the Optical Fiber
It is shown that signal energy is the only available degree-of-freedom (DOF) for fiber-optic transmission as the input power tends to infinity. With n signal DOFs at the input, n ́ 1 DOFs are asymptotically lost to signal-noise interactions. The main observation is that, nonlinearity introduces a multiplicative noise in the channel, similar to fading in wireless channels. The channel is viewed i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2977082